翻訳と辞書
Words near each other
・ Count Your Blessings (Bring Me the Horizon album)
・ Count Your Blessings (compilation album)
・ Count Your Blessings (hymn)
・ Count Your Blessings (Instead of Sheep)
・ Count Your Blessings (Richard Morgan & Edith Temple song)
・ Count Your Blessings, Woman
・ Count Your Change
・ Count Your Lucky Stars Records
・ Count Your Sheep
・ Count Yourself In
・ Count Zero
・ Count Zero (band)
・ Count's 77
・ Count's Feud
・ Count's House
Count-distinct problem
・ Count-kings
・ Countable chain condition
・ Countable Corp.
・ Countable set
・ Countably compact space
・ Countably generated
・ Countably generated module
・ Countably generated space
・ Countdown
・ Countdown (1968 film)
・ Countdown (2004 film)
・ Countdown (2011 film)
・ Countdown (2012 film)
・ Countdown (Australian TV series)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Count-distinct problem : ウィキペディア英語版
Count-distinct problem
In computer science, the count-distinct problem〔

(also known in applied mathematics as the cardinality estimation problem) is the problem of finding the number of distinct elements in a data stream with repeated elements.
This is a well-known problem with numerous applications. The elements might represent IP addresses of packets passing through a router, unique visitors to a web site, elements in a large database, motifs in a DNA sequence, or elements of RFID/sensor networks.
==Formal definition==
: Instance: A stream of elements x_1,x_2,\ldots,x_s with repetitions, and an integer m . Let n be the number of distinct elements, namely n = |\left\| , and let these elements be \left\ .
: Objective: Find an estimate \widehat of n using only m storage units, where m \ll n .
An example of an instance for the cardinality estimation problem is the stream: a,b,a,c,d,b,d . For this instance, n = |\left\| = 4 .

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Count-distinct problem」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.